An algorithm for finding a minimal recursive path ordering
نویسندگان
چکیده
منابع مشابه
AN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملAn Algorithm for Finding a Long Path in a Graph
An algorithm is described which constructs a long path containing a selected vertex x in a graph G. In hamiltonian graphs, it often finds a hamilton cycle or path. The algorithm uses crossovers of order k ≤ M , where M is a fixed constant, to build a longer and longer path. The method is based on theoretical methods often used to prove graphs hamiltonian.
متن کاملCertified Higher-Order Recursive Path Ordering
Recursive path ordering (RPO) is a well-known reduction ordering introduced by Dershowitz [6], that is useful for proving termination of term rewriting systems (TRSs). Jouannaud and Rubio generalized this ordering to the higher-order case thus creating the higher-order recursive path ordering (HORPO) [8]. They proved that this ordering can be used for proving termination of higher-order TRSs wh...
متن کاملThe Higher-Order Recursive Path Ordering
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed lambda-calculus generated by a signature of polymorphic higher-order function symbols. The obtained ordering is well-founded, compatible with -reductions and with polymorphic typing, monotonic with respect to the funct...
متن کاملA Path - Finding Algorithm for Loop - Free
| A loop-free path-nding algorithm (LPA) is presented ; this is the rst routing algorithm that eliminates the formation of temporary routing loops without the need for internodal synchronization spanning multiple hops or the speciication of complete or variable-size path information. Like other previous algorithms, LPA operates by specifying the second-to-last hop and distance to each destinati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO. Informatique théorique
سال: 1985
ISSN: 0399-0540
DOI: 10.1051/ita/1985190403591